#include <iostream>
#include <stdio.h>

using namespace std;

int cnt;

bool isPrime(int n)
{
    if (n < 2) 
        return false;
    if (n == 2) 
        return true;
    if (n % 2 == 0) 
        return false;
    for (int i = 3; i * i <= n; i += 2) 
    {
        if (n % i == 0) 
            return false;
    }
    return true;
}

void countFactors(int n, int start)
{
    if (isPrime(n)) 
    {
        cnt++; 
        return;
    }
    else 
    {
        for (int i = start; i < n; i++) 
        {
            if (0 == n % i) 
            {
                cnt++;
                while (0 == n % i) 
                    n /= i;
                countFactors(n, i + 1);
                return;
            }
        }
    }
}
int main()
{
    int n;
    while (cin >> n) 
    {
        cnt = 0;
        countFactors(n, 2);
        cout << cnt << endl;
    }
    return 0;
}